Eigenvalues of Hermitian Matrices with Positive Sum of Bounded Rank
نویسنده
چکیده
We give a minimal list of inequalities characterizing the possible eigenvalues of a set of Hermitian matrices with positive semidefinite sum of bounded rank. This answers a question of A. Barvinok.
منابع مشابه
A quadratic inequality for sum of co-adjoint orbits
We obtain an e¤ective lower bound on the distance of sum of coadjoint orbits from the origin. Even when the distance is zero, thus the symplectic quotient is well-de ned, our result give a nontrivial constraint on these co-adjoint orbits. In the particular case of unitary groups, we recover the quadratic inequality for eigenvalues of Hermitian matrices satisfying A+B = C: This quadratic inequal...
متن کاملLecture 5: Eigenvalues of Hermitians Matrices
This lecture takes a closer look at Hermitian matrices and at their eigenvalues. After a few generalities about Hermitian matrices, we prove a minimax and maximin characterization of their eigenvalues, known as Courant–Fischer theorem. We then derive some consequences of this characterization, such as Weyl theorem for the sum of two Hermitian matrices, an interlacing theorem for the sum of two ...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملThe bounds of the eigenvalues for rank-one modification of Hermitian matrix
The eigenproblems of the rank-one updates of the matrices have lots of applications in scientific computation and engineering such as the symmetric tridiagonal eigenproblems by the divide-andconquer method and Web search engine. Many researchers have well studied the algorithms for computing eigenvalues of Hermitian matrices updated by a rank-one matrix [1–6]. Recently, Ding and Zhou studied a ...
متن کاملEigenvalue problem for Hermitian matrices and its generalization to arbitrary reductive groups
1 Hermitian eigenvalue problem For any n × n Hermitian matrix A, let λA = (λ1 ≥ · · · ≥ λn) be its set of eigenvalues written in descending order. (Recall that all the eigenvalues of a Hermitian matrix are real.) We recall the following classical problem. Problem 1. (The Hermitian eigenvalue problem) Given two n-tuples of nonincreasing real numbers: λ = (λ1 ≥ · · · ≥ λn) and μ = (μ1 ≥ · · · ≥ μ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005